Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
781	Homology Flows, Cohomology Cuts∗ Erin W. Chambers† Jeff Erickson‡ Amir Nayyeri§ Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 00:53:08 Planar graph Maximum flow problem Shortest path problem Minor Graph coloring Neighbourhood Homeomorphism Tree decomposition Connectivity Graph theory Mathematics Graph operations
782	Hands-On Lab Code Discovery using the Architecture Tools in Visual Studio Ultimate 2013 Add to Reading List Source URL: download.microsoft.com Language: English - Date: 2013-12-18 20:14:30 DGML Graph drawing Graph coloring Graph theory Mathematics Connectivity
783	Undirected Graphs and Networks Networks and graphs A network is a collection of objects connected to each other in some specific way. A graph is a finite set of dots called vertices (or nodes) connected by links called e Add to Reading List Source URL: www.di-mgt.com.au Language: English - Date: 2003-09-21 13:50:00 Graph connectivity Graph coloring Hamiltonian path Eulerian path Path Graph Spanning tree Tree Route inspection problem Graph theory Theoretical computer science NP-complete problems
784	JSS Journal of Statistical Software MMMMMM YYYY, Volume VV, Issue II. http://www.jstatsoft.org/ Add to Reading List Source URL: jung.sourceforge.net Language: English - Date: 2005-03-03 22:32:28 JUNG Adjacency list Vertex Shortest path problem Neighbourhood Path Clique Edge coloring Graph theory Mathematics Graph
785	Some practical experiences of hard graph problems Keith Briggs [removed] Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2006-06-08 04:34:22 Graph coloring Clique Independent set Fractional coloring Clique problem Graph theory Theoretical computer science NP-complete problems
786	How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling Add to Reading List Source URL: clerc.maurice.free.fr Language: English - Date: 2012-11-29 03:08:56 NP-complete problems Travelling salesman problem Graph coloring Hamiltonian path Connectivity Edge coloring Bellman–Ford algorithm Graph theory Theoretical computer science Mathematics
787	June[removed]C3P 913 Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Add to Reading List Source URL: www.ligo.caltech.edu Language: English - Date: 2002-09-04 11:24:40 Parallel computing Graph coloring NP-complete problems Distributed algorithms Distributed computing Parallel algorithm Simulated annealing Distributed memory Computer cluster Concurrent computing Computing Computer programming
788	Research Statement—sarah-marie belcastro I think of myself as a semi-generalist because I have knowledge and interests ranging across geometry, topology, algebra, and discrete mathematics. My graduate training was in a Add to Reading List Source URL: www.toroidalsnark.net Language: English - Date: 2012-09-21 21:35:05 Edge coloring Snark Planar graph Cubic graph Minor Four color theorem Graph embedding Topology Nauru graph Graph theory Graph coloring Topological graph theory
789	What Cannot Be Computed Locally!∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-05-29 12:05:51 Graph theory NP-complete problems Spanning tree Connectivity Graph coloring R-tree B-tree Degree Tree Theoretical computer science Mathematics Computational complexity theory
790	On the Locality of Bounded Growth Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-05-19 08:04:24 NP-complete problems Graph coloring Search algorithms Connectivity Unit disk graph Nearest neighbor search Distributed computing Connected component Dominating set Theoretical computer science Graph theory Mathematics

UPDATE